home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
Shareware Overload Trio 2
/
Shareware Overload Trio Volume 2 (Chestnut CD-ROM).ISO
/
dir42
/
gnudbm14.zip
/
HASH.C
< prev
next >
Wrap
C/C++ Source or Header
|
1990-08-24
|
3KB
|
79 lines
/* hash.c - The gdbm hash function. */
/* This file is part of GDBM, the GNU data base manager, by Philip A. Nelson.
Copyright (C) 1990 Free Software Foundation, Inc.
GDBM is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 1, or (at your option)
any later version.
GDBM is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with GDBM; see the file COPYING. If not, write to
the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
You may contact the author by:
e-mail: phil@wwu.edu
us-mail: Philip A. Nelson
Computer Science Department
Western Washington University
Bellingham, WA 98226
phone: (206) 676-3035
*************************************************************************/
/*
* MS-DOS port (c) 1990 by Thorsten Ohl, td12@@ddagsi3.bitnet
*
* To this port, the same copying conditions apply as to the
* original release.
*
* IMPORTANT:
* This file is not identical to the original GNU release!
* You should have received this code as patch to the official
* GNU release.
*
* MORE IMPORTANT:
* This port comes with ABSOLUTELY NO WARRANTY.
*
* $Header: e:/gnu/gdbm/RCS/hash.c'v 1.4.0.1 90/08/16 09:22:38 tho Exp $
*/
#include <stdio.h>
#include <sys/types.h>
#ifndef MSDOS
#include <sys/file.h>
#endif /* not MSDOS */
#include <sys/stat.h>
#include "gdbmdefs.h"
/* This hash function computes a 31 bit value. The value is used to index
the hash directory using the top n bits. It is also used in a hash bucket
to find the home position of the element by taking the value modulo the
bucket hash table size. */
LONG
_gdbm_hash (key)
datum key;
{
LONG value; /* Used to compute the hash value. */
int index; /* Used to cycle through random values. */
/* Set the initial value from key. */
value = 0x238F13AF * key.dsize;
for (index = 0; index < key.dsize; index++)
value = (value + (key.dptr[index] << (index*5 % 24))) & 0x7FFFFFFF;
value = (1103515243 * value + 12345) & 0x7FFFFFFF;
/* Return the value. */
return value;
}